Descubriendo Patrones Craneofaciales Usando Datos Cefalométricos Multivariados para la Toma de Decisiones en Ortodoncia

Indexación: Web of Science; Scielo.The aim was to find craniofacial morphology patterns in a multivariate cephalometric database using a clustering technique. Cephalometric analysis was performed in a sample of 100 teleradiographs collected from Chilean orthodontic patients. Thirty cephalometric measurements were taken from commonly used analysis. The computed variables were used to perform a clustering analysis with the k-means algorithm to identify patterns of craniofacial morphology. The J48 decision tree was used to analyze each cluster, and the ANOVA test to determine the statistical differences between the clusters. Four clusters were found that had significant differences (P<0.001) in 24 of the 30 variables studied, suggesting that they represent different patterns of craniofacial form. Using the decision tree, 8 of the 30 variables appeared to be relevant for describing the clusters. The clustering analysis is effective in identifying different craniofacial patterns based on a multivariate database. The distinct clusters appear to be caused by differences in the compensation process of the facial structure responding to a genetically determined cranial and mandible form. The proposed method can be applied to several databases, creating specific classifications for each one of them. KEY WORDS: Craniofacial patterns; Morphological patterns; Clustering technique; Orthodontics.RESUMEN: El objetivo fue encontrar patrones morfológicos craneofaciales, a partir de una base de datos cefalométricos multivariada, utilizando una técnica de clustering. Se realizó un análisis cefalométrico a una muestra de 100 telerradiografías pertenecientes a pacientes chilenos de ortodoncia. Treinta medidas cefalométricas obtenidas de los análisis más utilizados fueron registradas. Las variables computadas se utilizaron para realizar un análisis de clustering con el algoritmo k-medias, para identificar patrones de morfología craneofacial. El árbol de decisión J48 se utilizó para analizar cada cluster, y test de ANOVA para determinar diferencias estadísticamente significativas entre los clusters. Se encontraron cuatro clusters con diferencia estadísticamente significativas (p<0,001) en 24 de las 30 variables estudiadas, lo que sugiere que efectivamente corresponden a diferentes patrones craneofaciales. Utilizando el árbol de decisión, se pudo determinar que 8 de las 30 variables resultaron ser relevantes en la definición de los clusters. El análisis de clustering es efectivo en identificar patrones morfológicos craneofaciales usando una base de datos multivariada. Los distintos cluster encontrados, aparentemente se formarían a partir de diferencias en el proceso de compensación de la estructura facial, en respuesta a la forma mandibular genéticamente determinada. El método propuesto puede ser aplicado a múltiples bases de datos, creando clasificaciones específicas para cada una de ellas. PALABRAS CLAVE: Patrones craneofaciales; Patrones morfológicos; Técnica de clustering; Ortodoncia.http://ref.scielo.org/qdkkz

h-analysis and data-parallel physics-informed neural networks

We explore the data-parallel acceleration of physics-informed machine learning (PIML) schemes, with a focus on physics-informed neural networks (PINNs) for multiple graphics processing units (GPUs) architectures. In order to develop scale-robust and high-throughput PIML models for sophisticated applications which may require a large number of training points (e.g., involving complex and high-dimensional domains, non-linear operators or multi-physics), we detail a novel protocol based on $h$-analysis and data-parallel acceleration through the Horovod training framework. The protocol is backed by new convergence bounds for the generalization error and the train-test gap. We show that the acceleration is straightforward to implement, does not compromise training, and proves to be highly efficient and controllable, paving the way towards generic scale-robust PIML. Extensive numerical experiments with increasing complexity illustrate its robustness and consistency, offering a wide range of possibilities for real-world simulations

Neutral space analysis for a Boolean network model of the fission yeast cell cycle network

BackgroundInteractions between genes and their products give rise to complex circuits known as gene regulatory networks (GRN) that enable cells to process information and respond to external stimuli. Several important processes for life, depend of an accurate and context-specific regulation of gene expression, such as the cell cycle, which can be analyzed through its GRN, where deregulation can lead to cancer in animals or a directed regulation could be applied for biotechnological processes using yeast. An approach to study the robustness of GRN is through the neutral space. In this paper, we explore the neutral space of a Schizosaccharomyces pombe (fission yeast) cell cycle network through an evolution strategy to generate a neutral graph, composed of Boolean regulatory networks that share the same state sequences of the fission yeast cell cycle.ResultsThrough simulations it was found that in the generated neutral graph, the functional networks that are not in the wildtype connected component have in general a Hamming distance more than 3 with the wildtype, and more than 10 between the other disconnected functional networks. Significant differences were found between the functional networks in the connected component of the wildtype network and the rest of the network, not only at a topological level, but also at the state space level, where significant differences in the distribution of the basin of attraction for the G1 fixed point was found for deterministic updating schemes.ConclusionsIn general, functional networks in the wildtype network connected component, can mutate up to no more than 3 times, then they reach a point of no return where the networks leave the connected component of the wildtype. The proposed method to construct a neutral graph is general and can be used to explore the neutral space of other biologically interesting networks, and also formulate new biological hypotheses studying the functional networks in the wildtype network connected component

Bayesian Constitutionalization: Twitter Sentiment Analysis of the Chilean Constitutional Process through Bayesian Network Classifiers

Constitutional processes are a cornerstone of modern democracies. Whether revolutionary or institutionally organized, they establish the core values of social order and determine the institutional architecture that governs social life. Constitutional processes are themselves evolutionary practices of mutual learning in which actors, regardless of their initial political positions, continuously interact with each other, demonstrating differences and making alliances regarding different topics. In this article, we develop Tree Augmented Naive Bayes (TAN) classifiers to model the behavior of constituent agents. According to the nature of the constituent dynamics, weights are learned by the model from the data using an evolution strategy to obtain a good classification performance. For our analysis, we used the constituent agents&rsquo; communications on Twitter during the installation period of the Constitutional Convention (July&ndash;October 2021). In order to differentiate political positions (left, center, right), we applied the developed algorithm to obtain the scores of 882 ballots cast in the first stage of the convention (4 July to 29 September 2021). Then, we used k-means to identify three clusters containing right-wing, center, and left-wing positions. Experimental results obtained using the three constructed datasets showed that using alternative weight values in the TAN construction procedure, inferred by an evolution strategy, yielded improvements in the classification accuracy measured in the test sets compared to the results of the TAN constructed with conditional mutual information, as well as other Bayesian network classifier construction approaches. Additionally, our results may help us to better understand political behavior in constitutional processes and to improve the accuracy of TAN classifiers applied to social, real-world data

Hyper-parameter tuning of physics-informed neural networks: Application to Helmholtz problems

We consider physics-informed neural networks [Raissi et al., J. Comput. Phys. 278 (2019) 686-707] for forward physical problems. In order to find optimal PINNs configuration, we introduce a hyper-parameter tuning procedure via Gaussian processes-based Bayesian optimization. We apply the procedure to Helmholtz problems for bounded domains and conduct a thorough study, focusing on: (i) performance, (ii) the collocation points density $r$ and (iii) the frequency $\kappa$, confirming the applicability and necessity of the method. Numerical experiments are performed in two and three dimensions, including comparison to finite element methods

Predicting Facial Biotypes Using Continuous Bayesian Network Classifiers

Bayesian networks are useful machine learning techniques that are able to combine quantitative modeling, through probability theory, with qualitative modeling, through graph theory for visualization. We apply Bayesian network classifiers to the facial biotype classification problem, an important stage during orthodontic treatment planning. For this, we present adaptations of classical Bayesian networks classifiers to handle continuous attributes; also, we propose an incremental tree construction procedure for tree like Bayesian network classifiers. We evaluate the performance of the proposed adaptations and compare them with other continuous Bayesian network classifiers approaches as well as support vector machines. The results under the classification performance measures, accuracy and kappa, showed the effectiveness of the continuous Bayesian network classifiers, especially for the case when a reduced number of attributes were used. Additionally, the resulting networks allowed visualizing the probability relations amongst the attributes under this classification problem, a useful tool for decision-making for orthodontists

Dynamical and topological robustness of the mammalian cell cycle network: A reverse engineering approach

A common gene regulatory network model is the threshold Boolean network, used for example to model the Arabidopsis thaliana floral morphogenesis network or the fission yeast cell cycle network. In this paper, we analyze a logical model of the mammalian cell cycle network and its threshold Boolean network equivalent. Firstly, the robustness of the network was explored with respect to update perturbations, in particular, what happened to the attractors for all the deterministic updating schemes. Results on the number of different limit cycles, limit cycle lengths, basin of attraction size, for all the deterministic updating schemes were obtained through mathematical and computational tools. Secondly, we analyzed the topology robustness of the network, by reconstructing synthetic networks that contained exactly the same attractors as the original model by means of a swarm intelligence approach. Our results indicate that networks may not be very robust given the great variety of limit cycles that a network can obtain depending on the updating scheme. In addition, we identified an omnipresent network with interactions that match with the original model as well as the discovery of new interactions. The techniques presented in this paper are general, and can be used to analyze other logical or threshold Boolean network models of gene regulatory networks. © 2013 Elsevier Ireland Ltd